A Straighteng Algorithm for Row-convex Tableaux. 0
نویسنده
چکیده
منابع مشابه
Straightening Laws for Row-Convex Tableaux
We introduce the notion of a straight tableau and prove that the straight tableaux of xed row-convex shape form a basis for the GL n -representations and the general linear Lie superalgebra representations associated to the given shape. We provide a straightening algorithm for expressing arbitrary tableaux in terms of straight tableaux. These techniques can be modi ed to provide bases for repre...
متن کاملA straightening algorithm for row-convex tableaux
We produce a new basis for the Schur and Weyl modules associated to a row-convex shape D. The basis is indexed by new class of \straight" tableaux which we introduce by weakening the usual requirements for standard tableaux. Spanning is proved via a new straightening algorithm for expanding elements of the representation into this basis. For skew shapes, this algorithm specializes to the classi...
متن کاملRow-convex tableaux and the combinatorics of initial terms
We characterize the initial terms under a diagonal term order of the supersymmetric Schur/Weyl module S(V V ) associated to a row-convex shape D. We show the biwords corresponding to the initial terms of S are closed under dual-Knuth equivalence and that the recording tableaux for these words are decomposable in the sense of [10]. We consider the natural action of bases of S in which the elemen...
متن کاملInversions of Semistandard Young Tableaux
A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau columnstandard. An i-inverted Young tableau is a row-standard tableau with precisely i inversion pairs, and may be interpreted as a generalization of (column-standard) Young tableaux. Inverted Young tableaux that lack repeated entries were introdu...
متن کاملN ov 2 00 0 COMPLEMENTARY ALGORITHMS FOR TABLEAUX
We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion. The fourth operation, hopscotch, is new, although specialised versions have appeared previously. Like the other three operations, this new operation may be computed with a set of local rules in a growth diagram, and it prese...
متن کامل